An empirical evaluation of auction-based task allocation in multi-robot teams
نویسندگان
چکیده
Task allocation is an important topic in multiagent and multi-robot teams. In recent years, there has been much research on the use of auction-based methods to provide a distributed approach to task allocation. Team members bid on tasks based on local information, and the allocation is based on these bids. The focus of prior work has been on optimal allocations and has established that auction-based methods perform well in comparison with optimal methods, with the advantage of scaling better. Here we take a different approach, comparing auction-based methods not on the optimality of the allocation, but on the efficient execution of the allocated tasks. This approach factors in aspects such as the utilisation of the team members and the degree to which they interfere with each others’ progress, giving a fuller picture of the practical use of auction-based methods.
منابع مشابه
Sequential Single-Cluster Auctions
My thesis is concerned with task allocation in multi-robot teams operating in dynamic environments. The key contribution of this work is the development of a distributed multi-robot task allocation auction that allocates clusters of tasks to robots over multiple bidding rounds. Empirical evaluation has shown this auction routine performs well in handling online task insertion and task reallocat...
متن کاملAuction-Based Task Allocation for Multi-robot Teams in Dynamic Environments
There has been much research on the use of auction-based methods to provide a distributed approach to task allocation for robot teams. Team members bid on tasks based on their locations, and the allocation is based on these bids. The focus of prior work has been on the optimality of the allocation, establishing that auction-based methods perform well in comparison with optimal allocation method...
متن کاملSequential Single-Cluster Auctions for Multi-Robot Task Allocation
This thesis studies task allocation in multi-robot teams operating in dynamic environments. The multi-robot task allocation problem is a complex NP-Complete optimisation problem with globally optimal solutions often difficult to find. Because of this, the rapid generation of near optimal solutions to the problem that minimise task execution time and/or energy used by robots is highly desired. O...
متن کاملMulti-Robot Task Allocation Strategies Using Auction-Like Mechanisms
Task allocation is a complex and open problem for multi-robot systems. In this paper, we present three strategies for dynamically allocating tasks in a colony of mobile robots. The system is partially inspired on auction and thresholds-based methods and tries to determine the optimum number of robots that are needed to solve specific tasks, or sub-goals, in order to minimize the execution time ...
متن کاملAuctions for robust task execution in multi-robot teams
We present an auction-based method for dynamic allocation of tasks to robots. The robots have to visit locations in a 2D environment for which they have a map. Unexpected obstacles, loss of communication, and other delays may prevent a robot from completing its allocated tasks. Therefore tasks not yet achieved are rebid every time a task has been completed. This provides an opportunity to impro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014